Partitioning Pairs of Countable Sets of Ordinals
نویسنده
چکیده
Lemma 1. There are ω1 disjoint stationary subsets of ω1. Proof. Let Cub(ω1) = {X ⊆ ω1 : ∃C ⊆ X(C is club on ω1)}. Then Cub(ω1) is countably complete filter. Its dual ideal Cub (ω1) = {X ⊆ ω1 : ∃X ′ ∈ Cub(ω1)(X = ω1\X ′)} is countably complete and contains all singletons and so all countable subsets of ω1. Recall also that X ⊆ ω1 is stationary if and only if X / ∈ Cub(ω1). For every ρ < ω1 let fρ : ρ → ω be an injective mapping. Then ∀α < ω1 ∀n ∈ ω let X α = {ρ < ω1 : α < ρ and fρ(α) = n}. Note that if α 6= β then for every n ∈ ω we have X α ∩ X β = ∅ (otherwise ∃ρ < κ greater than α, β such that fρ(α) = fρ(β) = n which is a contradiction to fρ being injective). Also for every α < ω1 ∪n∈ωX α = {ρ < ω1 : α < ρ} ∈ Cub(ω1).
منابع مشابه
More on Partitioning Triples of Countable Ordinals
Consider an arbitrary partition of the triples of all countable ordinals into two classes. We show that either for each finite ordinal m the first class of the partition contains all triples from a set of type ω +m, or for each finite ordinal n the second class of the partition contains all triples of an nelement set. That is, we prove that ω1 → (ω + m,n)3 for each pair of finite ordinals m and...
متن کاملCOUNTABLE COMPACTNESS AND THE LINDEL¨OF PROPERTY OF L-FUZZY SETS
In this paper, countable compactness and the Lindel¨of propertyare defined for L-fuzzy sets, where L is a complete de Morgan algebra. Theydon’t rely on the structure of the basis lattice L and no distributivity is requiredin L. A fuzzy compact L-set is countably compact and has the Lindel¨ofproperty. An L-set having the Lindel¨of property is countably compact if andonly if it is fuzzy compact. ...
متن کاملOn a dichotomy related to colourings of de nable graphs in generic models
We prove that in the Solovay model every OD graph G on reals satisses one and only one of the following two conditions: (I) G admits an OD colouring by ordinals; (II) there exists a continuous homomorphism of G 0 into G; where G 0 is a certain F locally countable graph which is not ROD colourable by ordinals in the Solovay model. If the graph G is locally countable or acyclic then (II) can be s...
متن کاملCountable Unions of Simple Sets in the Core Model
We follow 8] in asking when a set of ordinals X is a countable union of sets in K, the core model. We show that, analogously to L, an X closed under the canonical 1 Skolem function for K can be so decomposed, provided K is such that no !-closed lters are put on its measure sequence, but not otherwise. This proviso holds if there is no inner model of a weak Erd} os type property.
متن کاملThe Church Problem for Countable Ordinals
A fundamental theorem of Büchi and Landweber shows that the Church synthesis problem is computable. Büchi and Landweber reduced the Church Problem to problems about ω-games and used the determinacy of such games as one of the main tools to show its computability. We consider a natural generalization of the Church problem to countable ordinals and investigate games of arbitrary countable length....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 55 شماره
صفحات -
تاریخ انتشار 1990